Two problems in prediction theory

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On two problems in graph Ramsey theory

We study two classical problems in graph Ramsey theory, that of determining the Ramsey number of bounded-degree graphs and that of estimating the induced Ramsey number for a graph with a given number of vertices. The Ramsey number r(H) of a graph H is the least positive integer N such that every twocoloring of the edges of the complete graph KN contains a monochromatic copy of H. A famous resul...

متن کامل

Two Problems in Multiterminal Information Theory

of the Dissertation Two Problems in Multiterminal Information Theory

متن کامل

Two Symmetry Problems in Potential Theory

The method of proof combines the Maximum Principles and the device (which goes back to A. D. Alexandroff: every embedded surface in R with constant mean curvature must be a sphere) of moving planes to a critical position and then showing that the solution is symmetric about the limiting plane. In a subsequent article, H. F. Weinberger [3] gave a simplified proof for the special case of the Pois...

متن کامل

Two problems in thermal field theory

Two problems in thermal field theory François Gelis Brookhaven National Laboratory, Nuclear Theory, Bldg 510A, Upton, NY-11973, USA Abstract. In this talk, I review recent progress made in two areas of thermal field theory. In particular, I discuss various approaches for the calculation of the quark gluon plasma thermodynamical properties, and the problem of its photon production rate.

متن کامل

Two Extremal Problems in Graph Theory

We consider the following two problems. (1) Let t and n be positive integers with n ≥ t ≥ 2. Determine the maximum number of edges of a graph of order n that contains neither Kt nor Kt,t as a subgraph. (2) Let r, t and n be positive integers with n ≥ rt and t ≥ 2. Determine the maximum number of edges of a graph of order n that does not contain r disjoint copies of Kt. Problem 1 for n < 2t is s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Studia Mathematica

سال: 1984

ISSN: 0039-3223,1730-6337

DOI: 10.4064/sm-78-1-7-14